Performance Comparison of SB and FPCF Packet Switches

نویسندگان

  • Andrej KOS
  • Jurij. F. TASIČ
  • Iztok HUMAR
  • Janez BEŠTER
چکیده

In this paper performance analysis and comparison of a SB (Synchronous Bulk) and FPCF (Forward-Planning Conflict-Free) packet switches is joined with different types of traffic. Real traffic flows were captured in various network environments. Based on real traffic flows, MWM (Multifractal Wavelet Model) and Poisson equivalent synthetic traffic flows were generated. Performance is evaluated by using discrete-event simulations. The largest maximum throughputs for simple types of real traffic, e.g. low burstiness, low input asymmetry, low output asymmetry, are achieved using SB packet switch with an SF (Stretch Factor) around 5. For more complex real traffic types, e.g. higher burstiness, higher input asymmetry, higher output asymmetry, the largest maximum throughputs are achieved using FPCF packet switch. Also, compared to SB packet switch, FPCF packet switch proved to be much more insensitive to traffic anomalies.

برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

ثبت نام

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

منابع مشابه

The impact of bursty traffic on FPCF packet switch performance

This paper analyses and compares the performance of forward planning conflict-free (FPCF), virtual output queuing-partitioned (VOQ-P) and virtual output queuing-shared (VOQ-S) packet switches. The influence of packet burst size, offered switch load and packet switch size are all investigated. Packet loss probability, average packet delay and 99.9% packet delay values are also derived. In compar...

متن کامل

FPCF Input-Queued Packet Switch for Variable-Size Packets

The existing forward planning conflict-free (FPCF) packet switches are designed for fixed-size packets and synchronous operation mode. In this paper an asynchronous FPCF packet switch for variable-size packets is proposed. The key problem of efficient packet insertion procedure was solved by introduction of a so-called quasi-synchronous record array arrangement. A performance evaluation based o...

متن کامل

Performance Analysis of Cell and Packet Switch with Finite Input Queues and Ilpf Scheduling Algorithm

In this paper, packet loss probability performance in cell-based and packet-based switches with finite Input Queues (IQ) and iLPF scheduling algorithm are analysed. This algorithm has been proposed as a practical scheduling algorithm to achieve 100% throughput in cell-based switches. The scheduling algorithm is implemented in three cases: cellbased (CB-iLPF) switching, packet-based (PB-iLPF) sw...

متن کامل

A Comparison and Performance of Different Optical Switching Architectures

Optical Packet Switching (OPS) and transmission networks based on Wavelength Division Multiplexing (WDM) have been increasingly deployed in the Internet infrastructure over the last decade in order to meet the huge increasing demand for bandwidth. Several different technologies have been developed for optical packet switching such as space switches, broadcast-and-select, input buffered switches...

متن کامل

Comparative Performance Study of WDM Packet Switch for Different Traffic Arrival Approach

— Optical packet switching is a promising technology, which can integrate both data and optical network. In this paper, we present a comparative study of various traffic arrival approaches in WDM packet switches. The comparison is made based on packet loss rate and average delay under uniform and self-similar Pareto traffic. Computer simulations are performed in order to obtain the switch perfo...

متن کامل

ذخیره در منابع من


  با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید

برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

ثبت نام

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

عنوان ژورنال:

دوره   شماره 

صفحات  -

تاریخ انتشار 2003